The Extended-octree Spheroid Subdivision and Coding Model
نویسندگان
چکیده
Discrete Global Grid has been widely used as the basic data model of digital earth. But it is only confined to the earth surface, and it can not reach to the earth inside or outside. The extended-Octree (e-Octree) spheroid subdivision and coding model proposed here provides a new kind of global 3D grid. This e-Octree model is based on the extension of octree structure, and there are three kinds of extended mechanisms including regular octree, degraded octree and adaptive octree. The process of partition and coding is discussed in details. The prototype system of e-Octree model is implemented, in which e-Octree model has been used to visualize global terrain and space object orbits. These typical applications experiments show that the e-Octree model could not only be used in global change research and earth system science, but also be used for dynamic simulation and spatial index. * Corresponding author: Xuefeng CAO, [email protected].
منابع مشابه
A New Spatial Framework for Digital Earth: Sphere Shell Space 3D Grid
Discrete Global Grid data model has been widely used in digital earth. But it is only confined to the surface, and then it can not reach to the inside and outside of the earth surface. The Sphere Shell Space 3D Grid (SSSG) proposed here sets up a new spatial reference framework for the whole earth 3D space. The subdivision and coding model of SSSG is designed and carried out, which is called as...
متن کاملOctree-Based Progressive Geometry Coding of Point Clouds
We propose a generic point cloud encoder that compresses geometry data including positions and normals of point samples corresponding to 3D objects with arbitrary topology. In this work, the coding process is led by an iterative octree cell subdivision of the object space. At each level of subdivision, positions of point samples are approximated by the geometry centers of all tree-front cells w...
متن کاملOctree-Based Progressive Geometry Encoder
Among progressive 3D mesh compression algorithms, the kd-tree-based algorithm proposed by Gandoin and Devillers [1] is one of the state-of-the-art algorithms. Based on the observation that this geometry coder has a large amount of overhead at high kd-tree levels, we propose an octree-based geometry coder that demands a less amount of coding bits at high octree levels by applying selective cell ...
متن کاملEfficient Parallel Recursive Voxelization for SGI Challenge Multi-Processor System
Recursive algorithms are generally not straightforward to be processed in parallel, particularly when an octree is involved. Some researchers have tried to process an octree in parallel, but this solution is restricted to recursive subdivision methods that guarantee surface containment in an octant. In this paper we show a whole class of recursive subdivision algorithms which does not fall into...
متن کاملOctant Priority for Radiosity Image Rendering
This paper presents a new scheme for image display using radiosity methods. An octree technique performs subdivision of polygons which is required in any radiosity method. The octree-based subdivision not only subdivides polygons into patches, but also produces a sequence of leaf octants implicitly sorted in the octree. By traversing the octree, a depth priority of these leaf octant,s with resp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013